Some conditions for $n$-convex functions

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inequalities of Ando's Type for $n$-convex Functions

By utilizing different scalar equalities obtained via Hermite's interpolating polynomial, we will obtain lower and upper bounds for the difference in Ando's inequality and in the Edmundson-Lah-Ribariv c inequality for solidarities that hold for a class of $n$-convex functions. As an application, main results are applied to some operator means and relative operator entropy.

متن کامل

Some Results on Convex Spectral Functions: I

In this paper, we give a fundamental convexity preserving for spectral functions. Indeed, we investigate infimal convolution, Moreau envelope and proximal average for convex spectral functions, and show that this properties are inherited from the properties of its corresponding convex function. This results have many applications in Applied Mathematics such as semi-definite programmings and eng...

متن کامل

Extending n-Convex Functions

We are given data α1, . . . , αm and a set of points E = {x1, . . . , xm}. In this paper we address the question of conditions ensuring the existence of a function f satisfying the interpolation conditions f(xi) = αi, i = 1, . . . ,m, that is also n-convex on a set properly containing E. We consider both one point extensions of E, and extensions of E to all of IR. We also determine bounds on n-...

متن کامل

Fractional Hermite-Hadamard type inequalities for n-times log-convex functions

In this paper, we establish some Hermite-Hadamard type inequalities for function whose n-th derivatives are logarithmically convex by using Riemann-Liouville integral operator.

متن کامل

On Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions

Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1981

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1981-0614883-1